Triangle clipping for 3d graphics

ABSTRACT

A geometry and lighting graphics accelerator with an improved clipping process. Clipping is performed prior to any calculation or evaluation of primitives for lighting, texture, fog, or color. Barycentric coordinates are used to define all vertices: original, intermediate, and final intersection points. Use of barycentric coordinates results in less storage space. A circular buffer is used during the clipping process to store input and output polygons. Use of the circular buffer also results is reduced storage requirements.

CROSS-REFERENCE TO RELATED APPLICATION

[0001] This application claims priority from No. 60/071,590, filed Jan. 15, 1998, which is hereby incorporated by reference.

BACKGROUND AND SUMMARY OF THE INVENTION

[0002] The present application relates to graphics rendering hardware for computer graphics and animation systems, and particularly to clipping of such graphics in preparation for rendering.

[0003] Computer Graphics and Rendering

[0004] Modern computer systems normally manipulate graphical objects as high-level entities. For example, a solid body may be described as a collection of triangles with specified vertices, or a straight line segment may be described by listing its two endpoints with three-dimensional or two-dimensional coordinates. Such high-level descriptions are a necessary basis for high-level geometric manipulations, and also have the advantage of providing a compact format which does not consume memory space unnecessarily.

[0005] Such higher-level representations are very convenient for performing the many required computations. For example, ray-tracing or other lighting calculations may be performed, and a projective transformation can be used to reduce a three-dimensional scene to its two-dimensional appearance from a given viewpoint. However, when an image containing graphical objects is to be displayed, a very low-level description is needed. For example, in a conventional CRT display, a “flying spot” is moved across the screen (one line at a time), and the beam from each of three electron guns is switched to a desired level of intensity as the flying spot passes each pixel location. Thus at some point the image model must be translated into a data set which can be used by a conventional display. This operation is known as “rendering. ”

[0006] The graphics-processing system typically interfaces to the display controller through a “frame store” or “frame buffer” of special two-port memory, which can be written to randomly by the graphics processing system, but also provides the synchronous data output needed by the video output driver. (Digital-to-analog conversion is also provided after the frame buffer.) Such a frame buffer is usually implemented using SDRAM memory chips (or sometimes with SGRAM or VRAM). This interface relieves the graphics-processing system of most of the burden of synchronization for video output. Nevertheless, the amounts of data which must be moved around are very sizable, and the computational and data-transfer burden of placing the correct data into the frame buffer can still be very large.

[0007] Even if the computational operations required are quite simple, they must be performed repeatedly on a large number of datapoints. For example, in a typical high-end configuration, a display of 1280×1024 elements may need to be refreshed at 72 Hz, with a color resolution of 24 bits per pixel. If blending is desired, additional bits (e.g. another 8 bits per pixel) will be required to store an “alpha” or transparency value for each pixel. This implies manipulation of more than 3 billion bits per second, without allowing for any of the actual computations being performed. Thus it may be seen that this is an environment with unique data manipulation requirements.

[0008] If the display is unchanging, no demand is placed on the rendering operations. However, some common operations (such as zooming or rotation) will require every object in the image space to be re-rendered. Slow rendering will make the rotation or zoom appear jerky. This is highly undesirable. Thus efficient rendering is an essential step in translating an image representation into the correct pixel values. This is particularly true in animation applications, where newly rendered updates to a computer graphics display must be generated at regular intervals.

[0009] The rendering requirements of three-dimensional graphics are particularly heavy. One reason for this is that, even after the three-dimensional model has been translated to a two-dimensional model, some computational tasks may be bequeathed to the rendering process. (For example, color values will need to be interpolated across a triangle or other geometric structure constituting the objects of a graphic) These computational tasks tend to burden the rendering process. Another reason is that since three-dimensional graphics are much more lifelike, users are more likely to demand a fully rendered image. (By contrast, in the two-dimensional images created e.g. by a GUI or simple game, users will learn not to expect all areas of the scene to be active or filled with information.)

[0010]FIG. 6 is a very high-level view of processes performed in a 3D graphics computer system. A three dimensional image which is defined in some fixed 3D coordinate system (a “world” coordinate system) is transformed into a viewing volume (determined by a view position and direction), and the parts of the image which fall outside the viewing volume are discarded. The visible portion of the image volume is then projected onto a viewing plane, in accordance with the familiar rules of perspective. This produces a two-dimensional image, which is now mapped into device coordinates.

[0011] 3D Graphics

[0012] Three-dimensional graphics (3D graphics) refers to the practice of presenting a scene or image on a two-dimensional screen in such a way that it appears three dimensional. To do so, much care must be taken to accurately display surface textures, lighting, shadowing, and other characteristics. Displaying a 3D graphics image is much more difficult than displaying a traditional 2D image.

[0013] 3D Graphics Requirements

[0014] 3D graphics takes a great deal of computer processing power and memory. One of the performance measures for 3D games is frame rate, expressed in frames-per-second (fps), meaning the number of times each second an image can be redrawn to convey a sense of motion.

[0015] 3D Graphics Concepts

[0016] 3D graphics are spatial data represented in polygonal form with an associated set of characteristics, such as light, color, shade, texture, etc. The 3D graphics pipeline consists of two major stages, or subsystems, referred to as geometry and rendering. The geometry stage is responsible for managing all polygon activities and for converting 3D spatial data into pixels. The rendering stage is responsible for managing all memory and pixel activities. It renders data from the geometry stage into the final composition of the 3D image for painting on the CRT screen.

[0017] Before consulting how a scene is broken down to allow the computer to reconstruct it, one has to start with a scene which consists of shapes. The modeling process creates this information. Designers use specialized 3D graphics software tools, such as 3D Studio, to build polygonal models destined to be manipulated by computer. 3D Graphics Pipeline The first stage of the pipeline involves translating the model from its native coordinate space, or model coordinates, to the coordinate space of the application, or world coordinates. At this stage, the separate and perhaps unrelated coordinate systems defining objects in a scene are combined in a single coordinate system referred to as world space (World Space Co-ordinates). Translating objects into world space may involve clipping, or discarding elements of an object that fall outside the viewport or display window.

[0018] Interactive 3D graphics seek to convey an illusion of movement by changing the scene in response to the user's input. The technical term for changing the database of geometry that defines objects in a scene is transformation. The operations involve moving an object in the X, Y, or Z direction, rotating it in relation to the viewer (camera), or scaling it to change the size. (The X coordinate is moving left to right; Y is moving from top to bottom; Z is moving from “in front” to behind.)

[0019] When any change in the orientation or position of the camera is desired, every object in a scene must be recalculated relative to the new view. As can be imagined, a fast-paced game needing to maintain a high frame rate will demand a great deal of geometry processing. As scene complexity increases (more polygons) the computational requirements increase as well.

[0020] The setup stage is the point in the 3D pipeline where the host CPU typically hands off processing tasks to the hardware accelerator. Setup is the last stage before rasterization, or drawing, and can consume considerable processing time. The computational demands of the setup process depend on the number of parameters required to define each polygon as well as the needs of the pixel drawing engine.

[0021] Background: Barycentric Coordinates

[0022] Given a frame in three-dimensional World Space, a local coordinate system can be defined with respect to the frame. When given a set of points in three-dimensional space, a local coordinate system can also be constructed. These types of coordinate systems are called barycentric coordinates.

[0023] Barycentric coordinates are a method of introducing coordinates into an affine space. If the coordinates sum to one, they represent a point; if the coordinates sum to zero, they represent a vector. Consider a set of points P₀, P₁, . . . P_(n) and consider all affine combinations that can be taken from these points. That is, all points P that can be written as α₀P₀+α₁P₁+ . . . +α_(n)P_(n) for some α₀+α₁+ . . . +α_(n)=1. This set of points forms an affine space and the coordinates (α₀, α₁, . . . ,β_(n)) are called the barycentric coordinates of the points of the space.

[0024] These coordinate systems are quite useful, and used extensively, when working with polygons such as triangles.

[0025] Point in a Triangle

[0026]FIG. 4 depicts a triangle object. Consider three points P₁, P₂, P₃ in a plane. If α₁, α₂, and α₃ are scalars such that α₁+α₂+α₃=1, then the point P defined by P=α₁P₁+α₂P₂+α₃P₃ is a point on the plane of a triangle formed by P₁, P₂, P₃. The point is within the triangle ΔP₁P₂P₃ if 0≦α₁, α₂, α₃≦1. If any of the α's is less than zero or greater than one, the point P is outside the triangle. If any of the α's is 0, P is on one of the lines joining the vertices of the triangle.

EXAMPLE

[0027] Points P, Q, R of FIG. 4 were calculated using the following α's:

[0028] P: α₁=α₂=¼,α₃=½

[0029] Q: α₁=½,α₂=¾,α₃=−¼

[0030] R: α₁=0,α₂=¾,α₃=¼

[0031] Point P is within the triangle because all of its scalars are between 0 and 1. Point Q lies outside the triangle because one of its scalars is less than 0. Point R lies on a line joining two of the triangle's vertices because one of its scalars is equal to 0.

[0032] Local coordinates can be converted to barycentric coordinates for a given set of points. Given Frame F=(v₁,v₂,. . ,v_(n),O) for an affine space A, any point P in the space can be represented uniquely as:

[0033] P=p₁v₁+p₂v₂+ . . . +p_(n)v_(n)+O, where (p₁,p₂, . . . p_(n)) are the local coordinates of the point P with respect to the frame F. Points P_(i) can be defined as:

[0034] P₀=O

[0035] P₁=O+v₁

[0036] P₂=O+v₂

[0037] P_(n)=O+v_(n)

[0038] That is, the origin of the frame and the points obtained by adding the coordinate vectors to the origin). p₀ can be defined to be:

[0039] p₀=1−(p₁+p₂+ . . . +p_(n)).

[0040] Then P can be written as:

[0041] P=P₀+p₁(P₁−P₀) +p₂(P₂−P₀)+ . . . +p_(n)(P_(n)−P₀).

[0042] The affine equivalent of P is then:

[0043] P=p₀P₀+p₁P₁+ . . . +p_(n)P_(n) where p₀+p₁+ . . . +p_(n)=1

[0044] In this form, the values (p₀,p₁ . . .,p_(n)) are barycentric coordinates of P relative to the points (P₀,P₁ . . . P_(n))

[0045] Background: 3D Viewing

[0046] In 3D graphics, the image can be viewed from multiple angles and distances. The visible portion of entire image is that part of the image which can be seen through a projection window. Like a camera lens which defines the image projected onto film, a projection window can be anywhere from wide angle to macro, defining a wide or narrow view of the complete 3D image. The projection window is used to define a view volume. Only the objects within the view volume are rendered to the display screen. The view volume and the objects it encompasses are determined by the type of projection being displayed. FIG. 2 depicts a parallel projection, the view volume is an infinite parallelepiped. FIG. 3 depicts a perspective view, the view volume is a truncated pyramid, known as a frustrum. The viewing frustrum of FIG. 3 is depicted the sides angled at 45 degrees. However, a viewing frustrum can be defined with sides of varying angles. For simplicity, both parallelepipeds and truncated pyramids will be referred to as a frustrum.

[0047] In addition to a projection window, a near plane and a far plane can also be defined. These planes are parallel to the projection window and are used to eliminate objects from viewing based on their depth. Such planes allow objects far from the view plane, which would project as a single point to be removed from view. These planes also allow objects close to the view plane which might obscure other objects or be so large as to be unrecognizable to be removed from view. With near and far planes, a finite frustrum is created. That is, a frustrum bounded by six planes, near and far, left and right, and top and bottom, whose objects are rendered to a display according to the perspective of the projection window.

[0048] Background: 3D Clipping

[0049] A 3D graphics rendering system can save processing time by not rendering an entire image but rendering only the part of the image that lies in the frustrum. Clipping is the process of identifying and saving all the objects, or parts of objects, that are within the frustrum. Objects that are not within the frustrum are discarded.

[0050] Clipping can be performed on points, lines, or polygons. These points, lines, and polygons are known as primitives. Primitives define the shape of components of an object, using the positioning data of a coordinate system to describe how they fit together to construct an object. Clipping of a point results in the point being either outside or inside the viewing frustrum. Clipping of lines may result in new line segments, some outside and some inside the frustrum. Clipping of polygons may result in more than one polygon being within the frustrum. In traditional graphics rendering, clipping is performed once all the parameters for lighting, texture, color, fog, and other appearance parameters have been evaluated for each primitive.

[0051] Generally, clipping, particularly polygon clipping, is performed using one of several well-known algorithms such as the Sutherland and Hodgman polygon clipping algorithm. The Sutherland and Hodgman clipping technique is an iterative process which clips by comparing each polygon (primitive) to a particular clipping plane of the frustrum (near, far, left, right, top, and bottom). The result is a new output polygon, a set of vertices which defines the clipped area that is in the interior of the frustrum with respect to the particular clipping plane. This clipping process is documented in the paper REENTRANT POLYGON CLIPPING by I. Sutherland and G. Hodgman, which is hereby incorporated by reference and summarized in any good computer graphics text, however a brief description is included here for completeness.

[0052] The clipping algorithm for a polygon against a single clipping plane considers the input vertices P₁, P₂, . . . P_(n) one at a time. For each such input vertex zero, one or two of the output vertices Q₁, Q₂, . . . Q_(m) will be generated, depending on the input with respect to the clipping plane. Each input vertex, P, except the first is considered to be the terminal vertex of an edge: namely the edge defined by the input vertex value, P, and the position, S, of the just previous input vertex saved internally in a register. The algorithm will generate output vertices from the set Q₁, Q₂, Q_(m) depending on the relationship between the input vertex, P, the saved vertex, S, and the clipping plane. The four basic relationships between the plane and the edge SP are:

[0053] S and P are both visible Output P.

[0054] S and P are both invisible Output nothing.

[0055] S is visible and P is not Compute the intersection of SP with the plane and output.

[0056] P is visible and S is not Compute the intersection of SP with the plane and output. Also output P.

[0057] The beginning and end of the polygon need to be handled as a special case.

[0058] The simplest way to clip the polygon against multiple planes is to clip against the first plane as outlined above. This results in a new polygon which is clipped against the next plane and so on until all the planes have been used.

[0059] The usual implementation of the Sutherland and Hodgman algorithm requires the use of two separate buffers for holding the vertices of the input and output polygons. Before each successive clipping stage, the output polygon becomes the input polygon for the next stage. Therefore, each buffer must be large enough to hold the maximum number of vertices that can be produced. Each clip plane can add at most one extra vertex so with 12 clip planes and 4 vertices enough storage for a maximum of 16 vertices is required in each of the two buffers.

[0060] The Sutherland and Hodgman algorithm can be made recursive, however, it offers no real advantages in terms of performance or storage.

[0061] Improved Triangle Clipping for 3D Graphics

[0062] Unlike traditional clipping, the disclosed improved clipping process is performed prior to any lighting, fog, or texture calculations, including parameter evaluations for primitives. In the disclosed improved clipping process, all vertices are defined using barycentric coordinates. Improved clipping is performed against 6 viewing frustrum planes and 6 user defined planes. The clipping algorithm used is the Sutherland and Hodgman Polygon clipper. The vertex is visible in the viewing frustrum only if it is within the left and right, top and bottom, and near and far planes of the frustrum. The vertex must also be visible within any user defined clipping planes to be visible. The result of comparing a vertex against these 12 planes is at least one polygon and a code which indicates in which of the 12 planes the vertex is visible.

[0063] When an intersection point of two vertices needs to be calculated, barycentric coordinates are found rather than coordinates values (xyzw), color values (rgba), fog value (f), texture values (stq), specular-reflection coefficient value (ks), and diffuse-reflection coefficient value (kd). The barycentric values take up less storage space. However, intersection points which are within the clip planes require extra computations to yield the parameter values at the intersection.

[0064] Unlike traditional clipping methods which store the input and output clipped polygons in two separate buffers which are ping-ponged between, the disclosed improved clipping method uses circular buffering. A circular buffer is advantageous in an iterative clipping algorithm because the entries are processed sequentially and once an entry has been processed it is not needed again.

[0065] Additionally, a user definable threshold value can be set such that short lines and small triangles can avoid being clipped providing they don't cross the near or far frustrum clipping planes or any of the user clip planes.

[0066] A particular advantage of the disclosed clipping process is that clipping is performed prior to any evaluations of lighting, fog, or texture. This advantage allows expensive procedures, in terms of processing time, to be performed only on vertices that are most likely to appear in the frame. Another advantage of the disclosed clipping process is that use of barycentric coordinates saves in computation time as well as storage space.

[0067] Another advantage is that during the clipping process, many intermediate vertices are generated but the interpolated parameters do not need to be calculated for these intermediate points. Only the final intersection points, once clipping is complete have the full set of parameters calculated.

[0068] Another advantage is that the use of circular buffering saves storage.

[0069] Another advantage is that the use of circular buffering eliminates the ping-pong effect of accessing two separate buffers for polygon clipping.

[0070] Another advantage is that the user may define the point at which short lines or small triangles are clipped. If the line or triangle is not clipped, the whole line or triangle is rasterized in full and the screen and window scissor is used to discard out of view fragments. Thus, computationally intensive steps are saved.

BRIEF DESCRIPTION OF THE DRAWING

[0071] The disclosed inventions will be described with reference to the accompanying drawings, which show important sample embodiments of the invention and which are incorporated in the specification hereof by reference, wherein:

[0072]FIG. 1 depicts a functional block diagram of the preferred system.

[0073]FIG. 2 depicts a parallelepiped.

[0074]FIG. 3 depicts a frustrum.

[0075]FIG. 4 depicts a triangle frame with points PQR.

[0076]FIG. 5 depicts the triangle primitive of FIG. 4 intersecting the top and left planes of the viewing frustrum.

[0077]FIG. 6 depicts a high-level block diagram of processes performed in a 3D graphics computer system.

[0078]FIG. 7 depicts a block diagram of a system which can utilize the innovations.

[0079]FIG. 8 depicts a block diagram of a circular buffer for storing input and output clipped polygons.

[0080]FIG. 9 shows a high level view of the display system of a graphics computer system.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0081] The numerous innovative teachings of the present application will be described with particular reference to the presently preferred embodiment (by way of example, and not of limitation), in which:

[0082] Preferred System Context

[0083] The system context of the presently preferred embodiment is a GAMMA 3D Geometry and Lighting Accelerator chip for 3D graphics rendering using, among others, the OpenGL, Direct 3D, and QuickDraw 3D applications programming interfaces (APIs). The Hardware Reference Manual and Programmer's Reference Manual for this chip describe further details of this sample embodiment, and are both hereby incorporated by reference. Both are available, as of the effective filing date of this application, from 3Dlabs Inc. Ltd., 181 Metro Drive, Suite 520, San Jose, Calif. 95110. The geometry and lighting functions of graphics rendering are traditionally performed by the host computer. However, the GAMMA 3D Geometry and Lighting Accelerator is designed to be used in conjunction with a graphics accelerator such as GLINT™ to performing the actual graphics rendering more efficiently, relieving the host of some rather expensive (in terms of time) functions.

[0084] A functional block diagram of the preferred system is shown in FIG. 1. This figure shows the core of the GAMMA architecture. The GAMMA architecture is based on a message passing paradigm. In this system all the processing units are connected in a long pipeline with communication with the adjacent units being accomplished through message passing. Between each unit there is a small amount of buffering, the size being specific to the local communications requirements and speed of the two units.

[0085] The message rate is variable and depends on the rendering mode. The messages do not propagate through the system at a fixed rate typical of a more traditional pipeline system. If the receiving unit cannot accept a message because its input buffer is full the sending unit stalls until space is available.

[0086] The message structure is fundamental to the whole system as the messages are used to control, synchronize and inform each unit about the processing it is to undertake. Each message has two fields—a data field and a tag (command) field. The data field will hold color information, coordinate information, local state information, etc. The tag field is used by each block to identify the message type so it knows how to act on it. The GAMMA architecture has a message bus with an 11 bit tag width and a 128 bit data width. The large data width allows a 4 component coordinate or color to be transferred between units in a single cycle.

[0087] The GAMMA architecture employs lazy evaluation. That is, effort is only spent calculating a parameter that is actually needed. This is especially true with lighting calculations. Lighting calculations require multiple vertices in order to determine backface orientation. Therefore, lighting is deferred until after primitives which will not be displayed are clipped out. In the same manner, texture, fog, and other parameter calculations that are necessary only for display purposes are deferred until after clipping has been performed.

[0088] The Command Unit 102 performs direct memory access (DMA) functions required by the GAMMA accelerator. In addition to DMA functions, the Command Unit 102 implements circular buffering. Circular buffering allows the DMA controller to treat a region of memory as a first in first out (FIFO) structure.

[0089] The Vertex Machinery Unit 104 expands Open GL commands and their subsequent vertices in order that the rest of the units in the pipeline can operate within the message paradigm.

[0090] The function of the Transformation Unit 106 is to transform the coordinates of vertices, normals, or texture coordinates for use by the successive units. Transformation of the coordinates can include translation, rotation, and modification of coordinate space (eye space, normalised device coordinates, etc.). The Transformation Unit 106 contains space for both 3D and 2D coordinate transformations. In the presently preferred embodiment, the Transformation Unit 106 transforms incoming coordinates into a special clipping space. This clipping space is defined by a viewing frustrum with sides at 45 degrees, as depicted in FIG. 3. The angle of the sides of the viewing frustrum enables easier calculation of primitive intersections. Once the coordinates have been transformed to the special clipping space, each vertex in the triangle primitive is assigned a fixed barycentric coordinate: (1,0,0), (0,1,0), (0,0,1).

[0091] The Geometry Unit 108 takes incoming vertices and calculates outcodes (for clipping) and projected window coordinates. Clipping of most primitives is performed here. Calculations such as lighting, fog, and texture are deferred until after the Geometry Unit 108 in order to allow the clip test to take place, saving processing time further down the pipeline.

[0092] The Normalization Unit 110 transforms and normalises normals once the clip test and backface culling have demonstrated they are definitely needed for the lighting calculations.

[0093] The Lighting Unit 112, under the direction of the Geometry Unit 108, evaluates the lighting equations for a vertex and sends the ambient, diffuse, and specular light values to the Material Unit 114. Although only one Lighting Unit 112 is shown, several such units can be cascaded together to improve performance for multiple lighting graphics.

[0094] The Material Unit 114, also under the direction of the Geometry Unit 108, combines calculated light values with material properties, such as diffuse reflectance coefficient, to determine the color of a vertex.

[0095] The Delta Unit 116 calculates triangle and line set up parameters when the rasterizer chip is incapable of such calculations.

[0096] A Day in the Life of a Lit Triangle Mesh

[0097] Before we get too detailed in how improved clipping is performed, it is worth while looking in general terms at how a primitive (e.g. triangle) passes through the GAMMA pipeline, what messages are generated, and what happens in each unit, particularly the Geometry Unit 108 of the presently preferred embodiment. Some simplifications have been made in the description to avoid detail which would otherwise complicate what is really a very simple process.

[0098] The mesh we are going to follow through GAMMA has three fogged Gouraud shaded triangles in it. The first triangle will be trivially clipped out, the second triangle will need to be clipped and the third triangle is totally in view. Backface culling is enabled but no culling is done. The mesh has the following OpenGL Format:

[0099] Begin (TriangleStrip)

[0100] Normal

[0101] Vertex

[0102] Normal

[0103] Vertex

[0104] Normal

[0105] Vertex

[0106] Normal

[0107] Vertex

[0108] Normal

[0109] Vertex

[0110] End

[0111] All other states are assumed to be set up.

[0112] In the interest of brevity only a single Lighting Unit 112 has been assumed in the following description.

[0113] On receiving the Begin message the Vertex Machinery Unit 104 initializes an internal state so it can track the individual triangles which make up the mesh and their alternating orientation. Next, it tells the Geometry Unit 108, Normalization Unit 110, Lighting Unit 112, and Material Unit 114, using the NextVertex (0) message, that the next vertex is to go in vertex store 0. The vertex stores cannot be addressed individually by messages as in the Delta Unit 116. Finally the Begin message is sent to all units, so they can do any other house keeping necessary.

[0114] Vertex 1

[0115] The Normal values are received via the Nx, Ny and Nz messages and the Vertex Machinery Unit 104 collects the individual components together and passes them collectively in the Normal message to the next unit. The individual vertex components (in the Vx, Vy, Vz and Vw messages) are collected together in a similar way and sent to the next unit in the Vertex message. The internal state is updated to record the first vertex has passed through and the NextVertex message sent to direct the next vertex to go into vertex store 1.

[0116] In the Transformation Unit 106 the Normal message causes matrix multiplication on the data field using the internal NormalMatrix. The result is saved internally (in case it is needed for texture coordinate generation) and forwarded on. The Vertex message causes the vertex data to be transformed by the ViewModelMatrix and the result sent in the EyeVertex message. The eye vertex is then transformed again by the ProjectionMatrix and this is sent in the ProjVertex message. The Transformation Unit 106 does not have a vertex store so ignores the NextVertex message.

[0117] In the Geometry Unit 108 the Normal message flows through and the eye vertex and projected vertices are both entered into the vertex store. The EyeVertex message is passed on to the Lighting Unit 112. The arrival of the ProjVertex message causes the outcode for the vertex to be calculated and entered into the vertex store. The outcodes are used for clip testing and to direct the clipping operation, if needed. The window coordinates are used for backface culling. The window coordinate calculations are deferred as the vertex is out of view. The NextVertex message advances the vertex pointer to the indicated vertex store in preparation for the next batch of vertex related data. It also resets some state management bits for the new vertex which keep track of what parameters have been calculated for it.

[0118] In the Normalization Unit 110 the Normal message updates the current normal register. The arrival of the ProjVertex message will update the appropriate vertex store (as previously set up by the NextVertex message) and set some state management variables. The Projvertex is passed on to the Lighting Unit 112.

[0119] The eye vertex is entered into the vertex store. The arrival of the ProjVertex message resets some state management bits for the vertex which keep track of what color(s) have been calculated for it. The NextVertex message advances the vertex pointer to the indicated vertex store in preparation for the next batch of vertex related data.

[0120] Vertex 2

[0121] The normal and vertex data is processed by the Vertex Machinery Unit 104, the Transformation Unit 106, Geometry Unit 108, Normalization Unit 110, Lighting Unit 112, and Material Unit 114 as previously described. The NextVertex message increments onto the next location in the vertex store.

[0122] Vertex 3

[0123] The normal and vertex data is processed as previously described. This time the Vertex Machinery Unit 104 has detected that enough vertices are present for a triangle, so it sends a GeomTriangle message followed by the NextVertex message. The vertex store location for the next vertex has been set back to zero (and will continue to cycle between 0, 1 and 2 for the duration of the triangle strip).

[0124] The GeomTriangle message passes through the Transformation Unit 106 with no effect and when it reaches the Geometry Unit 108 it starts the triangle processing. The first thing the triangle processing does is to check if the triangle can be trivially rejected. It does this by testing the three outcodes previously calculated and for this triangle the result is ‘not visible’ so the processing ends here.

[0125] Vertex 4

[0126] The normal and vertex data is processed as previously described. Now that one triangle has been processed each new vertex forms a new triangle so the Vertex Machinery Unit 104 sends a GeomTriangle message and then the NextVertex message. The vertex store location is incremented to 1.

[0127] The GeomTriangle message passes through the Transformation Unit with no effect and when it reaches the Geometry Unit 108 it starts the triangle processing. Note this time the new vertex has been added to the two left over from the previous triangle. The outcode test now shows that the triangle is partially in view and, consequently, needs to be clipped. Before clipping is done, any outstanding window coordinates are calculated (all three in this case) so that the “area” of the triangle can be determined and the backface orientation tested. The sign of the “area” indicates the orientation. No culling is done so in a last ditch attempt to avoid clipping the area is tested against a threshold value. For a small triangle it is faster to rasterize and scissor the excess area rather than do a full clip. This test is only done if near, far, or user clipping planes are not cut by the triangle. The triangle is clipped and the barycentric centric coordinates of the intersection points are calculated. The full clipping operation may have shown the triangle to be out of view in which case no intersections would have been calculated and processing ends here.

[0128] The triangle is to be fogged so each vertex is tested to see if the fog value has already been calculated. In this example no vertex has reached this stage of processing before so the fog calculation is done for all vertices.

[0129] The clipped triangle is likely to be a polygon so it is broken up into a fan of triangles and the parameters in the Delta Unit 116 tracked accordingly. The clipped triangle's vertices are either original vertices or intersection vertices defined by their barycentric coordinate. Original vertices have their fog and window coordinates sent to the Delta Unit 116 and the VertexColour message sent to the Normalization Unit 110, Lighting Unit 112, and Material Unit 114 to initiate the lighting calculations. The intersection vertices need to have their fog and window coordinates calculated first. Also the intersection vertices have their barycentric coordinates sent to the Material Unit 114 in the Barycentric message and the ClippedColour message is sent to initiate the intersection color to be calculated by the Material Unit 114. In this example, the first vertex is an intersection vertex. After enough data has been sent for the triangle, a RenderTriangle message is sent to notify the Delta Unit 116 that the triangle is ready to have its set up calculations done and be drawn.

[0130] The Normalization Unit 110, on receiving the VertexColour message, will normalize (if enabled) any outstanding normals and send them to the Lighting Unit 112. This is the first time, in this example, that the processing has reached the Normalization Unit 110 so all three normals will be processed.

[0131] The Lighting Unit 112 on receiving the Normal message will store the normal data in the indicated vertex store (encoded in the message tag). The VertexColour message causes the three vertex stores (holding the original triangle normal and eye vertex data) to be tested to see if the light values for theses vertices has already been calculated. In this example, this will not be the case as this is the first time the processing has reached the Lighting Unit 112. The light values (ambient, diffuse, and specular) for each vertex are calculated using the lighting equations and sent to the Material Unit 114 in the AmbientLight, DiffuseLight, and specular Light messages respectively. The target vertex store for these messages is encoded in the message tag.

[0132] The Material Unit 114 on receiving the AmbientLight, DiffuseLight, and Specular Light messages just stores the values in the corresponding vertex store location. The VertexColour message causes the three vertex stores (holding the light data) to be tested to see if the color values for these vertices has already been calculated. This will not be the case, in this example, as this is the first time the processing has reached the Material Unit 114. The color value for each vertex is calculated and sent to the Delta Unit 116 in the DeltaColour message. The target vertex store for these messages is encoded in the message tag.

[0133] The next message the Material Unit 114 receives is the Barycentric message so the barycentric coordinates are stored until later. The ClippedVertex message instructs the Material Unit 114 to calculate the color at the barycentric coordinate using the identified three original vertex colors and send it to the given vertex store in the Delta unit 116. Sending a clipped color to the Delta Unit 116 will invalidate the vertex color previously held in this vertex store so a subsequent VertexColour message referencing this vertex store will cause the clipped color in the Delta Unit 116 to be replaced by the vertex color.

[0134] The Delta Unit 116 has been receiving the window coordinate, color, and fog data for each vertex in the triangle which it stores in its vertex store. When the RenderTriangle message is received the parameters required by a graphics accelerator or other rendering hardware, to render the triangle are calculated and sent. In the presently preferred embodiment, GLINTS, a high performance graphics processor which combines workstation class 3D graphics acceleration, and state-of-the-art 2D performance in a single chip, is used in combination with GAMMA to render the primitive. Finally the Render message initiates the triangle rendering in the graphics accelerator.

[0135] The remaining triangle generated by the clipping operation is processed in a similar way. Note that no new lighting or material calculations are done.

[0136] Vertex 5

[0137] The normal and vertex data is processed as previously described. The Vertex Machinery Unit 104 sends a GeomTriangle message and then the NextVertex message. The vertex store location is incremented to 2.

[0138] The GeomTriangle message passes through the Transformation Unit 106 with no effect and when it reaches the Geometry Unit 108 it starts the triangle processing. Note, this time the new vertex has been added to the two left over from the previous triangle. The outcode test shows that the triangle is totally in view and, consequently, doesn't need to be clipped. The new vertex has it's window coordinates calculated. The area of the triangle is calculated (from the window coordinates) and the backface orientation tested. No culling is done. The triangle is to be fogged so each vertex is tested to see if the fog value has already been calculated. In this example the earlier two vertices have already had their fog calculation done the calculation is performed only for the new vertex. As the previous triangle was clipped, any retained state in the Delta Unit 116 is considered unreliable. The vertex information (window coordinates and fog) for each vertex in this triangle is sent. A VertexColour message is also sent to cause the Normalization Unit 110, Lighting Unit 112, and Material Unit 114 to calculate the color for the new vertex. Finally, a DrawTriangle message is sent.

[0139] The VertexColour message causes the Normalization Unit 110 to examine all three normals and to normalize (if enabled) those which haven't been done. Any new normals are sent to the Lighting Unit 112. Only the new normal falls into this category so it is processed as outlined immediately above.

[0140] The VertexColour message causes the Lighting Unit 112 to examine all three vertices and to light those without valid colors. Only the new vertex falls into this category and so its lighting calculations are performed and the light values sent to the Material Unit 114.

[0141] The VertexColour message causes the Material Unit 114 to examine all three vertices and to color those without valid colors. Only the new vertex falls into this category and has the material calculations performed for it. As the previous triangle was clipped, no retained colors in the Delta Unit 116 can be relied on so all three colors are sent to the Delta Unit 116.

[0142] The Delta Unit 116 has been receiving the vertex window coordinate, color and fog data for each vertex in the triangle which it stores in the vertex stores. When the DrawTriangle message is received, the parameters required by the graphics accelerator, GLINT™ in the presently preferred embodiment, to render the triangle are calculated and sent. Finally, the Render message initiates the triangle rendering in the graphics accelerator.

[0143] The final message sent by the host is the end message. In the case of a TriangleStrip this does nothing. However, for a Polygon or LineLoop, this message causes the last triangle or line segment to be drawn.

[0144] Behavioural Model

[0145] The following pseudo-code describes the operation of the disclosed clipping process in its presently preferred embodiment. Of course, many other implementations which express the operation of the clipping process can exist. The code below merely provides an example and is not meant to limit the disclosed clipping process in scope or embodiment in any way.

[0146] Geometry Unit

[0147] The presently preferred embodiment for improved clipping performs the innovative process in the Geometry Unit 108 of the GAMMA pipeline.

[0148] The Geometry Unit 108 performs the following activities:

[0149] Implements the remaining geometry processing for points, lines, triangles and rectangles. This includes clip testing and (if necessary) clipping, backface culling, perspective division, viewport mapping. Polymode processing for triangles is also implemented.

[0150] Calculates the fog and texture values for any vertices requiring them. This is done lazily so only those vertices which pass the backface cull and clipping have values calculated. If the vertex is shared with the previous primitive then the value will not be calculated again.

[0151] Applies the PolygonOffset when enabled.

[0152] Tracks parameter storage in the Delta Unit 116 so that only those parameters which have changed are sent. This is not so important when the Delta Unit 116 in GAMMA is used but conserves bus bandwidth when the parameters are sent to another chip across the PCI bus.

[0153] Controls the Normalization Unit 110, Lighting Unit 112, and Material Unit 114 so they only process valid vertices. The Material Unit 114 is also instructed to generate color information for intermediate vertices produced when a primitive is clipped.

[0154] The OpenGL Feedback and Select modes are also supported so that Picking and 3D selection will be accelerated.

[0155] Controlling the Downstream Units The Normalization Unit 110, Lighting Unit 112, and Material Unit 114 are controlled, in the presently preferred embodiment, by the Geometry Unit 108 using the VertexColour message. This message defines which vertices are to have their color calculated. The VertexColour message defines up to 3 vertices to do the calculations for and provides flags to indicate if the vertex is part of a front facing primitive and if the provoking vertex is to be used (because of flat shading).

[0156] Each unit is responsible for performing only its calculations if any of the parameters associated with a vertex has changed, or if the vertex changes from a ‘front facing’ vertex to a back facing vertex or vice versa. The Material Unit 114 also tracks what colors are stored in the Delta Unit 116 and will only send the color when it is first calculated or the orientation of the vertex changes or the color has been overwritten due to clipping.

[0157] When a primitive is clipped, the two or three original vertices have their colors calculated by the VertexColour message before visible parts of the primitive are rendered. The color of the intermediate vertices are calculated in the Material Unit 114 under control of the ClippedColour message issued by the Geometry Unit 108. Before this message is sent, the vertex colors will already have been established via the VertexColour message.

[0158] All the color calculations are deferred until after the clipping and backface culling has been done so they are only done when a vertex is really going to be used. Any changes to the material parameters, lighting parameters, etc. cannot be done while there are outstanding colors to be calculated. The Normalization Unit 110 monitors the message stream while between a Begin/End sequence for any messages which, if allowed to proceed, would cause the deferred color to be calculated using the new (and hence wrong) parameter. When such a situation is detected any deferred normals are validated and the ValidateVertexColours message sent. This will force the Lighting Unit 112 and Material Unit 114 to calculate any outstanding colors before the material, fog, etc. parameter has a chance to change. Once the ValidateVertexColours message has been sent, the message which caused the validation to occur is passed on.

[0159] During Feedback mode the vertex colors are inserted into the message stream by the Material Unit 114 when the Geometry Unit 108 sends a VertexColourFeedback message. The colors at the intermediate points generated during clipping are calculated in the Material Unit 114 when prompted by the ClippedColourFeedback message, also issued by the Geometry Unit 108.

[0160] Geometry Unit Operation

[0161] Floating Point Units

[0162] The floating point units follow the IEEE single precision format

[0163] Viewport Mapping

[0164] The viewport mapping takes the 4D homogeneous vertex coordinates and converts them into a 3D coordinate by dividing through by the homogenous component ‘w’. The resulting coordinate is often called the normalized device coordinate (or NDC). However, prior to clipping the NDC may extend beyond the ±1.0 range usually associated with normalized numbers.

[0165] The NDC is converted to a device coordinate by multiplying it by the ViewportScale vector and then adding the ViewportOffset vector. The X and Y values are scaled so the true NDC range (±1.0) fills the window (or viewport) while the Z value is nominally scaled to be in the range 0.0-1.0, although the OpenGL glDepthRange function can be used to change this.

[0166] It is preferable to bias the window coordinates (x, y) into a range where the number of fraction bits are constant from the minimal value in the range to the largest value in the range. This ensures that calculation based on the window coordinates such as the triangles area are position independent within a window and not susceptible to errors arising from fewer fraction bits being available in the top right corner than in the bottom left corner. This can be done by adjusting the ViewportOffset, however this bias will need to be removed in the Delta Unit 116 when the actual rasterizer coordinates are calculated. Also as this is an internal adjustment done for numerical reasons it is not visible to the user so any coordinate information returned during feedback mode will need to have any bias removed.

[0167] Improved Clipping

[0168] In the preferred embodiment, clipping is implemented prior to any lighting, fog or texture calculations are done so that the (expensive) lighting is only done for vertices which are guaranteed to be used for rendering. Traditional clipping is done once all the parameters (texture, color, fog, etc.) have been evaluated for the primitive. However, deferring the lighting (and texture, fog, etc.) calculations until after clipping prevents these calculations being done if the primitive is subsequently shown to be out of view. The clip test may show a primitive is partially in view, but in fact it may not be in view at all. Another savings is that during the clipping process many intermediate vertices are generated and the interpolated parameters do not need to be calculated for these intermediate points. Only the final intersection points once clipping is done have the full set of parameters calculated for them.

[0169] In the presently preferred embodiment, all vertices (original, intermediate and final intersection points) are defined using barycentric coordinates. The barycentric coordinate for vertex a is (1, 0, 0), for vertex b (0, 1, 0) and vertex c is (0, 0, 1). No provision is made for the special case of an original vertex being referenced (to save the linear combination calculation) to simplify the behavioral model. The weighting given to a parameter at a vertex is given by the associated barycentric component. If the barycentric coordinate for the intersection point is (a, b, c) and the parameter at vertex a is P_(a) at vertex _(b) is P_(b) etc. then the parameter at the intersection point is given by:

[0170] P_(i)=aP_(a)+bP_(b)+CP_(c)

[0171] For line primitives, the same method is used but now c=0. No attempt is made to optimize the equations in this case to factor out the unused term.

[0172] Clipping is performed against the viewing frustrum and up to 6 user defined clipping planes. The viewing frustrum is defined by the planes:

[0173] left x=−w

[0174] right x=+w

[0175] top y=+w

[0176] bottom y =−w

[0177] near z =+w

[0178] far z =−w

[0179] where w is the forth component of the vertex.

[0180] The user clipping planes are defined in eye space by the 4 coefficients (per clip plane) UserClipX, UserClipY, UserClipZ and UserClipW which are synonymous with the a, b, c, and d parameters, respectively, in the usual plane equation formula. A point is in view, if after substitution into the user clip plane equation, the result is positive.

[0181] The result of comparing a vertex against the 6 frustrum planes and the 6 user clipping planes is held in a 12 bit outcode variable. If the vertex is visible with respect to one of the planes then the corresponding bit is zero.

[0182] Each vertex is defined by the four values: x, y, z, and w and is visible only if all the following conditions are met:

[0183] (left)−w<=x<=w (right)

[0184] (bottom)−w<=y<=w (top)

[0185] (near)−w<=z <=w (far)

[0186] Each one of these 6 conditions is represented by a bit in an outcode word. If a condition is true then the corresponding bit is 0.

[0187] If the user clipping plane is defined by the four values: a, b, c and d then the vertex is visible if:

[0188] ax+by+cz+d≧0

[0189] If this condition is true for a given user clip plane then the corresponding bit in the outcode word is 0.

[0190] When an intersection point is to be calculated, the barycentric coordinates are found rather than the xyzw, rgba, f, stq, ks and kd values as they take up less storage. For intersection points which are never used there is a computation saving, but intersection points which are used need extra computations to yield the parameter values at the intersection.

[0191] For example, FIG. 5 depicts the triangle primitive of FIG. 4 intersecting the top and left planes of the viewing frustrum. Point P₁ is in the interior of the viewing frustrum while points P₂ and P₃ lie outside of the viewing frustrum. During clipping, the first plane to clip the primitive is the left viewing frustrum plane. Clipping of the primitive along the left plane results in a quadrilateral with an edge along the left plane and two new intersection points, P₄′ and P₅′. This new quadrilateral, P₁P₄′P₅′P₂ will then be clipped against the top plane of the viewing frustrum. This clip results in two new intersection points, P₆′ and P₇′, and in points, P₅′ and P₃ being discarded. The resulting quadrilateral, P₁P₄′P₆′P₇′, contains only one of the original primitive points and three new intersection points.

[0192] Intermediate intersection point P₅′ is never used. Therefore, a computational savings occurs as only its barycentric coordinates have been calculated. The savings is benchmarked over current clipping processes not incorporating barycentric coordinates. In such processes, calculation of parameters xyzw, rgba, f, etc. occurs for each point discarded or not. For those points which are not discarded, the use of barycentric coordinates results in a little more computation. However, the use of barycentric coordinates results in an overall savings. The amount of savings varies depending of the clipped out geometry.

[0193] The input and output clipped polygons are stored in a circular buffer rather than two separate buffers which are ping-ponged between as this takes up much less storage. Each clip plane can add at most one extra vertex so with 12 clip planes and 4 vertices we need enough storage for a maximum of 16 vertices (or 32 if two separate buffers were to be used).

[0194] A circular buffer works well in the context of polygon clipping because once an entry has been processed it is not needed again and the entries are processed sequentially. FIG. 8 depicts a block diagram of a circular buffer for storing input and output clipped polygons. This clipping circular buffer is 16 entries deep, one entry per vertex. Each entry is 109 bits wide, holding: a barycentric coordinate consisting of three floating point values, a twelve bit outcode, and an edge flag indicating if the barycentric point is on the edge of a particular plane. Pointers OutVertex and InVertex are used to mark the head and tail of the circular buffer, respectively.

[0195] Threshold Clipping

[0196] Short lines and small triangles can optionally avoid being clipped providing they don't cross the near or far frustrum clipping planes or any of the user clipping planes. In this case, the whole line or triangle is rasterized in full and the screen and window scissor is used to discard out of view fragments. This can be more efficient than doing a full clip. The threshold at which clipping occurs for lines and triangles is user defined.

[0197] System Context

[0198]FIG. 7 shows a personal computer which can take advantage of the improved clipping process. The complete personal computer system, includes in this example:

[0199] user input devices (e.g. keyboard 735 and mouse 740);

[0200] at least one microprocessor 725 which is operatively connected to receive inputs from said input device, through an interface manager chip 730 (which also provides an interface to the various ports);

[0201] a memory (e.g. flash or non-volatile memory 755 and RAM 760), which is accessible by the microprocessor;

[0202] a data output device (e.g. display 750 and video display adapter card 745) which is connected to output data generated by the microprocessor 725; and

[0203] a magnetic disk drive 770 which is read-write accessible, through an interface unit 765, by the microprocessor 725;

[0204] Optionally, of course, many other components can be included, and this configuration is not definitive by any means. For example, the personal computer may also include a CD-ROM drive 780 and floppy disk drive (“FDD”) 775 which may interface to the disk interface controller 765. Additionally, L2 cache 785 may be added to speed data access from the disk drives to the microprocessor, and a PCMCIA 790 slot accommodates peripheral enhancements.

[0205] The GAMMA 3D Geometry and Lighting Accelerator chip incorporating the innovative improved clipping process is be used with a graphics accelerator such as GLINT™ in the data output device to drive the display 750.

[0206]FIG. 9 shows a high level view of the display system of a graphics computer system. The CPU 910 executes an application which requires three-dimensional images. The application generates graphics data to be rendered to a geometry and lighting accelerator 920 which implements the disclosed improved triangle clipping method. After clipping, graphics data is then passed to the renderer 930. The renderer generates the image and stores it in a frame buffer. The frame buffer is read by the display driver 940, which draws the image on the monitor 950.

[0207] According to a disclosed class of innovative embodiments, there is provided: a method for clipping graphics primitives for display, comprising the steps of: defining all vertices of a primitive using relational coordinates; using a clipping algorithm with a circular buffer to store input and output polygons of said primitive; and for each vertex of said polygons: indicating whether it is visible with respect to each plane of a view volume.

[0208] According to another disclosed class of innovative embodiments, there is provided: a geometry unit, comprising: circuitry to define all vertices of a primitive using relational coordinates; circuitry to implement a clipping algorithm with a circular buffer to store input and output polygons of said primitive; and circuitry to set an outcode value for each said vertex indicating whether it is visible with respect to each of plane of said view volume.

[0209] According to another disclosed class of innovative embodiments, there is provided: a pipelined graphics system, comprising: a transformation unit connected to: transform a primitive into a clipping space, and assign a fixed barycentric coordinate to each vertex of said primitive; and a geometry unit connected to: perform clip testing on said primitives, clip said primitives, if necessary, according to said fixed barycentric coordinates, and set an outcode value for each said vertex indicating whether it is visible with respect to each plane of a view volume.

[0210] According to another disclosed class of innovative embodiments, there is provided: a computer system comprising: display hardware; a processor connected to provide graphics data a geometry and lighting accelerator connected to receive said graphics data, comprising a transformation unit connected to: transform a primitive into a clipping space, and assign a fixed barycentric coordinate to each vertex of said primitive; and a geometry unit connected to: perform clip testing on said primitives, clip said primitives, if necessary, according to said fixed barycentric coordinates, set an outcode value for each said vertex indicating whether it is visible with respect to each plane of a view volume, and output clipped graphics data to be rendered; and video rendering hardware connected to receive said clipped graphics data, generate graphics, and connected to display said graphics on said display hardware.

[0211] A vast amount of engineering effort has been invested in computer graphics systems, and this area is one of increasing activity and demands. The following background publications provide additional detail regarding possible implementations of the disclosed embodiments, and of modifications and variations thereof: see, generally, ADVANCES IN COMPUTER GRAPHICS (ed. Enderle 1990-); Chellappa and Sawchuk, DIGITAL IMAGE PROCESSING AND ANALYSIS (1985); COMPUTER GRAPHICS HARDWARE (ed. Reghbati and Lee 1988); COMPUTER GRAPHICS: IMAGE SYNTHESIS (ed. Joy et al.); Foley et al., FUNDAMENTALS OF INTERACTIVE COMPUTER GRAPHICS (2.ed. 1984); Foley, COMPUTER GRAPHICS PRINCIPLES & PRACTICE (2.ed. 1990); Foley, INTRODUCTION TO COMPUTER GRAPHICS (1994); Giloi, Interactive Computer Graphics (1978); Hearn and Baker, COMPUTER GRAPHICS (2.ed. 1994); Hill, COMPUTER GRAPHICS (1990); Latham, DICTIONARY OF COMPUTER GRAPHICS (1991); Magnenat-Thalma, IMAGE SYNTHESIS THEORY & PRACTICE (1988); Newman and Sproull, PRINCIPLES OF INTERACTIVE COMPUTER GRAPHICS (2.ed. 1979); PICTURE ENGINEERING (ed. Fu and Kunii 1982); PICTURE PROCESSING & DIGITAL FILTERING (2.ed. Huang 1979); Prosise, How COMPUTER GRAPHICS WORK (1994); Rimmer, BIT MAPPED GRAPHICS (2.ed. 1993); Salmon, COMPUTER GRAPHICS SYSTEMS & CONCEPTS (1987); Schachter, COMPUTER IMAGE GENERATION (1990); Watt, THREE-DIMENSIONAL COMPUTER GRAPHICS (2.ed. 1994); Scott Whitman, MULTIPROCESSOR METHODS FOR COMPUTER GRAPHICS RENDERING; the SIGGRAPH PROCEEDINGS for the years 1980-to date; and the IEEE Computer Graphics and Applications magazine for the years 1990-to date; all of which are hereby incorporated by reference.

[0212] Modifications and Variations

[0213] As will be recognized by those skilled in the art, the innovative concepts described in the present application can be modified and varied over a tremendous range of applications, and accordingly the scope of patented subject matter is not limited by any of the specific exemplary teachings given.

[0214] The foregoing text has indicated a large number of alternative implementations, particularly at the higher levels, but these are merely a few examples of the huge range of possible variations.

[0215] For example, In the preferred embodiment GAMMA is used to accelerate geometry and lighting calculations for the GLINT™ family of graphics accelerators. However, GAMMA makes use of a standard interface. Therefore, GAMMA can be used in conjunction with a multitude of graphics accelerator cards of the same or different manufacturer.

[0216] For another example, the examples given in present disclosure make use of the OpenGL graphics API. However, GAMMA currently supports other standard API such as Direct3D and QuickDraw 3D and is easily adaptable to support proprietary standards.

[0217] For another example, the preferred chip context can be combined with other functions, or distributed among other chips, as will be apparent to those of ordinary skill in the art.

[0218] For another example, the described graphics systems and subsystems can be used, in various adaptations, not only in high-end PC's, but also in workstations, arcade games, and high-end simulators.

[0219] For another example, the described graphics systems and subsystems are not necessarily limited to color displays, but can be used with monochrome systems.

[0220] For another example, the described graphics systems and subsystems are not necessarily limited to displays, but also can be used in printer drivers. 

What is claimed is:
 1. A method for clipping graphics primitives for display, comprising the steps of: defining all vertices of a primitive using relational coordinates; using a clipping algorithm with a circular buffer to store input and output polygons of said primitive; and for each vertex of said polygons: indicating whether it is visible with respect to each plane of a view volume.
 2. The method of claim 1, wherein only vertices which are visible in all said planes are rasterized.
 3. The method of claim 1, wherein said using step is performed prior to any lighting, fog, or texture calculations.
 4. The method of claim 1, wherein said primitive is a polygon.
 5. The method of claim 1, wherein said primitive is a triangle.
 6. The method of claim 1, wherein said relational coordinates are barycentric.
 7. The method of claim 1, wherein said view volume is a frustrum.
 8. The method of claim 1, wherein there are six or more planes in said view volume.
 9. The method of claim 1, wherein there are six planes in said view volume.
 10. The method of claim 1, wherein there are twelve planes in said view volume.
 11. The method of claim 1, wherein said clipping algorithm is the Sutherland and Hodgman polygon clipping algorithm.
 12. The method of claim 1, wherein vertex visibility in each of said planes is indicated by a bit flag.
 13. The method of claim 1, wherein vertex visibility is indicated by twelve bit code.
 14. The method of claim 1, wherein two circular buffers are used to store said input and output polygons.
 15. The method of claim 1, wherein said circular buffer has a maximum storage of sixteen vertices.
 16. A geometry unit, comprising: circuitry to define all vertices of a primitive using relational coordinates; circuitry to implement a clipping algorithm with a circular buffer to store input and output polygons of said primitive; and circuitry to set an outcode value for each said vertex indicating whether it is visible with respect to each of plane of said view volume.
 17. The geometry unit of claim 16, wherein only vertices which are visible in all said planes are rasterized.
 18. The geometry unit of claim 16, wherein said clipping algorithm is implemented prior to any lighting, fog, or texture calculations.
 19. The geometry unit of claim 16, wherein said primitive is a polygon.
 20. The geometry unit of claim 16, wherein said primitive is a triangle.
 21. The geometry unit of claim 16, wherein said relational coordinates are barycentric.
 22. The geometry unit of claim 16, wherein said view volume is a frustrum.
 23. The geometry unit of claim 16, wherein there are six or more planes in said view volume.
 24. The geometry unit of claim 16, wherein said clipping algorithm is the Sutherland and Hodgman polygon clipping algorithm.
 25. The geometry unit of claim 16, wherein vertex visibility in each of said planes is indicated by a bit flag.
 26. The geometry unit of claim 16, wherein two circular buffers are used to store said input and output polygons.
 27. The geometry unit of claim 16, wherein said circular buffer has a maximum storage of sixteen vertices.
 28. A pipelined graphics system, comprising: a transformation unit connected to: transform a primitive into a clipping space, and assign a fixed barycentric coordinate to each vertex of said primitive; and a geometry unit connected to: perform clip testing on said primitives, clip said primitives, if necessary, according to said fixed barycentric coordinates, and set an outcode value for each said vertex indicating whether it is visible with respect to each plane of a view volume.
 29. The pipelined graphics system of claim 28, wherein only vertices which are visible in all said planes are rasterized.
 30. The pipelined graphics system of claim 28, wherein said clipping is implemented prior to any lighting, fog, or texture calculations.
 31. The pipelined graphics system of claim 28, wherein said primitive is a triangle.
 32. The pipelined graphics system of claim 28, wherein said view volume is a frustrum.
 33. The pipelined graphics system of claim 28, wherein there are six or more planes in said view volume.
 34. The pipelined graphics system of claim 28, wherein said clipping uses the Sutherland and Hodgman polygon clipping algorithm.
 35. The pipelined graphics system of claim 28, wherein vertex visibility in each of said planes is indicated by a bit flag.
 36. The pipelined graphics system of claim 28, wherein two circular buffers are used to store said input and output polygons.
 37. The pipelined graphics system of claim 28, wherein said circular buffer has a maximum storage of sixteen vertices.
 38. A computer system comprising: display hardware; a processor connected to provide graphics data a geometry and lighting accelerator connected to receive said graphics data, comprising a transformation unit connected to: transform a primitive into a clipping space, and assign a fixed barycentric coordinate to each vertex of said primitive; and a geometry unit connected to: perform clip testing on said primitives, clip said primitives, if necessary, according to said fixed barycentric coordinates, set an outcode value for each said vertex indicating whether it is visible with respect to each plane of a view volume, and output clipped graphics data to be rendered; and video rendering hardware connected to receive said clipped graphics data, generate graphics, and connected to display said graphics on said display hardware.
 39. The computer system of claim 38, wherein said clipping is implemented prior to any lighting, fog, or texture calculations.
 40. The computer system of claim 38, wherein said primitive is a triangle.
 41. The computer system of claim 38, wherein said clipping uses the Sutherland and Hodgman polygon clipping algorithm.
 42. The computer system of claim 38, wherein vertex visibility in each of said planes is indicated by a bit flag.
 43. The computer system of claim 38, wherein two circular buffers are used to store said input and output polygons.
 44. The method of claim 38, wherein said video rendering hardware is a GLINT 500TX.
 45. The method of claim 38, wherein said video rendering hardware is a GLINT PERMEDIA.
 46. The method of claim 38, wherein said processor is an X86-compatible processor. 